1221. Split a String in Balanced Strings - LeetCode Solution


String Greedy Counting

Python Code:

class Solution:
    def balancedStringSplit(self, s: str) -> int:
        count = -1
        stack = []
        
        for i in range(len(s)):
            if not stack:
                count+=1
                stack.append(s[i])
            else:
                if stack[-1] != s[i]:
                    stack.pop()
                else:
                    stack.append(s[i])
        if not stack:
            count+=1
        return count


Comments

Submit
0 Comments
More Questions

779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II
274. H-Index
260. Single Number III
240. Search a 2D Matrix II
238. Product of Array Except Self
229. Majority Element II